cient Multivariate Factorization Over
نویسندگان
چکیده
We describe the Maple 23] implementation of multivariate factorization over general nite elds. Our rst implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its eeciency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general tool for implementing computations in GF (p k))x1; x2; : : : ; xv ]. We also needed an eecient implementation of our algorithms in Zpy]]x] because any multivariate factorization may depend on several bivariate factorizations. The eeciency of our implementation is illustrated by the ability to factor bivariate polynomials with over a million monomials over a small prime eld.
منابع مشابه
Rings: an efficient Java/Scala library for polynomial rings
In this paper we briey discuss Rings — an ecient lightweight library for univariate and multivariate polynomial arithmetic over arbitrary coecient rings. Basic algebra, GCDs and factorization of polynomials are implemented with the use of modern asymptotically fast algorithms. Rings provides a clean API for algebra and a fully typed hierarchy of mathematical structures. Scala API additionall...
متن کاملEfficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general to...
متن کاملRelations in Categories
This thesis investigates relations over a category C relative to an (E;M)-factorization system of C. In order to establish the 2-categoryRel(C) of relations over C in the rst part we discuss su cient conditions for the associativity of horizontal composition of relations, and we investigate special classes of morphisms in Rel(C). Attention is particularly devoted to the notion of mapping as de ...
متن کاملDeterministic distinct-degree factorization of polynomials over finite fields
A deterministic polynomial time algorithm is presented for finding the distinctdegree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in deterministic polynomial time, thus resolving a theoretical open problem of Kaltofen from 1987.
متن کاملFactoring Multivariate Polynomials over Algebraic Number Fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...
متن کامل